Continuous k-Nearest Neighbor Queries in Wireless Environments
نویسندگان
چکیده
منابع مشابه
Continuous aggregate nearest neighbor queries
This paper addresses the problem of continuous aggregate nearestneighbor (CANN) queries for moving objects in spatio-temporal data stream management systems. A CANN query specifies a set of landmarks, an integer k, and an aggregate distance function f (e.g., min, max, or sum), where f computes the aggregate distance between a moving object and each of the landmarks. The answer to this continuou...
متن کاملOn Processing of Continuous Bichromatic Reverse k-Nearest-Neighbor Queries
Bichromatic Reverse k-Nearest-Neighbor (BRkNN) query is a variant of the Reverse k-Nearest-Neighbor (RkNN) query that involves a set of service sites (e.g. gas stations) and a set of customer points (e.g. vehicles). It has many applications in Location-Based Services, in particular in mobile advertising. This paper investigates the processing of continuous BRkNN (CBRkNN) queries where the point...
متن کاملEfficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the continuous monitoring of the constrained k nearest neighbor (kNN) queries. In contrast to the conventional k nearest neighbors (kNN) queries, a constrained kNN query considers only the objects that lie within a region specified by...
متن کاملK-Nearest Neighbor Temporal Aggregate Queries
We study a new type of queries called the k-nearest neighbor temporal aggregate (kNNTA) query. Given a query point and a time interval, it returns the top-k locations that have the smallest weighted sums of (i) the spatial distance to the query point and (ii) a temporal aggregate on a certain attribute over the time interval. For example, find a nearby club that has the largest number of people...
متن کاملApproximate Continuous K Nearest Neighbor Queries for Continuous Moving Objects with Pre-defined Paths
Continuous K nearest neighbor queries (C-KNN) on moving objects retrieve the K nearest neighbors of all points along a query trajectory. In existing methods, the cost of retrieving the exact C-KNN data set is expensive, particularly in highly dynamic spatio-temporal applications. The cost includes the location updates of the moving objects when the velocities change over time and the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2017
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i48/104045